Low-level dichotomy for quantified constraint satisfaction problems
نویسندگان
چکیده
منابع مشابه
Low-level dichotomy for Quantified Constraint Satisfaction Problems
Building on a result of Larose and Tesson for constraint satisfaction problems (CSPs), we uncover a dichotomy for the quantified constraint satisfaction problem QCSP(B), where B is a finite structure that is a core. Specifically, such problems are either in ALogtime or are L-hard. This involves demonstrating that if CSP(B) is first-order expressible, and B is a core, then QCSP(B) is in ALogtime...
متن کاملSolving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can be used to model combinatorial problems containing contingency or uncertainty. It allows for universally quantified variables that can model uncertain actions and events, such as the unknown weather for a future party, ...
متن کاملAlgorithms for Quantified Constraint Satisfaction Problems
Many propagation and search algorithms have been developed for constraint satisfaction problems (CSPs). In a standard CSP all variables are existentially quantified. The CSP formalism can be extended to allow universally quantified variables, in which case the complexity of the basic reasoning tasks rises from NP-complete to PSPACE-complete. Such problems have, so far, been studied mainly in th...
متن کاملQCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems
The Quantified Constraint Satisfaction Problem (QCSP) is a generalization of the CSP in which some variables are universally quantified. It has been shown that a solver based on an encoding of QCSP into QBF can outperform the existing direct QCSP approaches by several orders of magnitude. In this paper we introduce an efficient QCSP solver. We show how knowledge learned from the successful enco...
متن کاملRelaxations and Explanations for Quantified Constraint Satisfaction Problems
The Quantified CSP (QCSP) is a generalisation of the classical CSP in which some of the variables are universally quantified [3]. We consider the problem of relaxing an instance of the QCSP when it is unsatisfiable. We propose several novel forms of problem relaxations for the QCSP and present an algorithm for generating conflict-based explanations of inconsistency. Our motivation comes from pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2011
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2011.07.010